The Probability That a Random Multigraph is Simple
نویسندگان
چکیده
منابع مشابه
The probability that a random multigraph is simple. II
Consider a random multigraph G∗ with given vertex degrees d1, . . . , dn, constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigraphs with the number of edges 1 2 ∑ i di → ∞, the probability that the multigraph is simple stays away from 0 if and only if ∑ i d 2 i = O (∑ i di ) . The new proof uses the method of moments, which m...
متن کاملThe Probability That a Random Multigraph is Simple
If n ≥ 1 and (di)1 is a sequence of non-negative integers, we let G(n, (di)1 ) be the random (simple) graph with the n vertices 1, . . . , n, and with vertex degrees d1, . . . , dn, uniformly chosen among all such graphs (provided that there are any such graphs at all; in particular, ∑ i di has to be even). A standard method to study G(n, (di)1 ) is to consider the related random multigraph G ∗...
متن کاملThe splitting design that leads to simple random sampling
Implementing unequal probability sampling, without replacement, is very complex and several methods have been suggested for its performance, including : Midseno design and systematic design. One of the methods that have been introduced by Devil and Tille (1998) is the splitting design that leads to simple random sampling .in this paper by completely explaining the design, with an example, we ha...
متن کاملOn the Probability That a Random ±1-matrix Is Singular
We report some progress on the old problem of estimating the prob-ability, Pn , that a random n x n ± I-matrix is singular:Theorem.There is a positive constant e for which Pn < (I et .This is a considerable improvement on the best previous bound, Pn =O( I /.../Ti) , given by Komlos in 1977, but still falls short of the often-conjecturedasymptotica1 formula Pn = (I +0...
متن کاملThe Probability that a Random Probable Prime is Composite
Consider a procedure which (1) chooses a random odd number n < x, (2) chooses a random number 6, 1 < b < n — 1, and (3) accepts n if bn~l = 1 (mod n). Let P(x) denote the probability that this procedure accepts a composite number. It is known from work of Erdös and the second author that P(x) —> 0 as x —► oo. In this paper, explicit inequalities are established for P(x)\ For example, it is show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2009
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548308009644